Bautch and Knoppers\u27 Covenant in the Persian period: From Genesis to Chronicles (Book Review)

A review of Bautch, R.J., & Knoppers, G.N. (Eds.). (2015). Covenant in the Persian period: From Genesis to Chronicles. Winona Lake, IN: Eisenbrauns. 452 pp. $58.05. ISBN 978157506356

R.J. Sommers

The single-spaced paragraph on the “About the Author” page of R.J. Sommers’ latest novel says she lives in a one-story house on the edge of a city. It says she is renowned for writing relatable characters and compelling relationships. It says nothing about her own friends. Gazing from a photo at the top of the page, R.J. Sommers appears to point a camera toward her readers..

Heavy ion collisions in the used nucleon model

It is shown that recently proposed by R.J. Glauber the used nucleon model combined with the assumption that the nucleon consists of two constituents (a quark and a diquark) describes well the PHOBOS data on particle production at midrapidity.Comment: 5 pages, 2 figure

Stochastic Games : recent results

Nous présentons des résultats récents sur les jeux stochastiques finis. Ce texte est à paraître dans le Handbook of Game Theory, vol 3., eds. R.J. Aumann et S. HartJeux stochastiques

On Hamiltonicity of {claw, net}-free graphs

An st-path is a path with the end-vertices s and t. An s-path is a path with an end-vertex s. The results of this paper include necessary and sufficient conditions for a {claw, net}-free graph G with given two different vertices s, t and an edge e to have (1)a Hamiltonian s-path, (2) a Hamiltonian st-path, (3) a Hamiltonian s- and st-paths containing edge e when G has connectivity one, and (4) a Hamiltonian cycle containing e when G is 2-connected. These results imply that a connected {claw, net}-free graph has a Hamiltonian path and a 2-connected {claw, net}-free graph has a Hamiltonian cycle [D. Duffus, R.J. Gould, M.S. Jacobson, Forbidden Subgraphs and the Hamiltonian Theme, in The Theory and Application of Graphs (Kalamazoo, Mich., 1980$), Wiley, New York (1981) 297--316.] Our proofs of (1)-(4) are shorter than the proofs of their corollaries in [D. Duffus, R.J. Gould, M.S. Jacobson] and provide polynomial-time algorithms for solving the corresponding Hamiltonicity problems. Keywords: graph, claw, net, {claw, net}-free graph, Hamiltonian path, Hamiltonian cycle, polynomial-time algorithm.Comment: 9 page